queueing network
英 [ˈkjuːɪŋ ˈnetwɜːk]
美 [ˈkjuːɪŋ ˈnetwɜːrk]
网络 排队网; 排队网络
双语例句
- Based on the above research, the graphical tool software of queueing network modeling and simulation is developed. These works provide the important reference to the pre-design and design evaluation for the building IoT.
基于以上研究成果，开发了图形化排队网络建模仿真软件，这些对物联网前期的设计工作与性能评价提供了重要的参考。 - We consider the matched queueing network PH/ M/ c →○ PH/ PH/ 1. The probability distribution function and its LS transform of the busy period of the first subsystem is derived, and the simplified algorithm for it is given.
本文讨论了匹配排队网络模型PH／M／c→○PH／PH／1的忙期，给出第一子系统忙期的概率分布函数及其LS变换，并给出其算法。 - Strong Approximation And Weak Convergence for N-union Station Fork-Join Queueing Network
N台并联Fork-Join排队网络的弱收敛与强逼近 - Based on the study of service control function ( SCF) software model in mobile intelligent network, we propose a general queueing network model of SCF.
在分析移动智能网SCF（ServiceControlFunction）软件功能模型的基础上，提出了一种通用的SCF排队网络模型。 - In order to analyze the blocking situation, the finite holding nodes are added to an open queueing network of the wireless sensor networks. Equivalent queueing network model is obtained. According to the usage of holding nodes, packet buffer size is determined.
为了对模型的阻塞情况进行分析，将无线传感器开放式排队网络加入有限个保持节点，获得等价的排队网络模型，根据保持节点使用情况确定数据包缓存大小。 - In this paper, N-union station Fork-Join queueing network is studied detailed by means of probability measure weak convergence and strong approximation in probability. We obtain weak convergence and strong approximation theorems for response time.
本文借助于概率测度弱收敛与概率论强逼近理论，较为详细地研究了N台并联Fork-Join排队网络，得到了响应时间、队长、离去过程的弱收敛与强逼近定理。 - The best configuration method of hardware packet buffer for the different types of sensor nodes is proposed. The packet queueing network model is established for large-scale sensor nodes using queueing networks with blocking.
提出了针对不同类型的感知节点硬件数据包缓存的最佳配置方法，应用带阻塞的排队网络对大规模的感知节点建立数据包排队网络模型。 - As a model approximating queueing network systems, Brownian model is obtained through proper scale of the original model based on heavy load theory.
Brownian模型是排队网络的一种近似模型，它以重载流理论为基础，通过对原模型进行适当的时空缩放后取极限而得到的。 - Analysis on queueing network of hospital outpatient service
医院门诊排队网络分析 - A Queueing Network Approximate Analysis Algorithm for the Performance Evaluation of Self-Timed Pipeline Rings
一种用于异步流水线环性能分析的排队网络近似分析算法